Constructive Tightly Grounded Autoepistemic Reasoning

نویسنده

  • Ilkka Niemelä
چکیده

The key concept of autoepistemic logic introduced by Moore is a stable expansion of a set of premises, i.e., a set of beliefs adopted by an agent with perfect introspection capabilities on the basis of the premises. Moore's formal-ization of a stable expansion, however, is non-constructive and produces sets of beliefs which are quite weakly grounded in the premises. A new more constructive definition of the sets of beliefs of the agent is proposed. It is based on classical logic and enumerations of formulae. Considering only a certain subclass of enumera-tions, L-hierarchic enumerations, an attractive class of expansions is captured to characterize the sets of beliefs of a fully introspective agent. These L-hierarchic expansions are stable set minimal, very tightly grounded in the premises and independent of the syntactic representation of premises. Furthermore, Reiter's default logic is shown to be a special case of autoepistemic logic based on L-hierarchic expansions .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weakened Negative Introspection

A new weakened scheme for negative introspection in autoepistemic reasoning is proposed. The scheme is formulated proof-theoretically in terms of enumer-ations of formulae. The resulting sets of conclusions based on this negative introspec-tion principle, cautious autoepistemic expansions, generalize Moore style stable expansions such that every set of premises has a cautious expansion. A nitar...

متن کامل

A Scheme for Weakened Negative Introspection in Autoepistemic Reasoning

A novel scheme for weakened negative introspection in au-toepistemic reasoning is proposed. The scheme is formulated proof-theoretically in terms of enumerations of formulae. The resulting sets of conclusions , cautious expansions, are a generalization of Moore style stable expansions such that each set of premises has a cautious expansion. A nitary characterization is provided for the cautious...

متن کامل

Generalised Proof-Theory for Multi-Agent Autoepistemic Reasoning

Over the past few years, several different approaches have been proposed to deal with multiagent autoepistemic reasoning. Despite some limitations, each approach is important in its own right. While Pafikh’s approach allows an agent to reason uonmonotonically about other agents’ knowledge, it cannot reason about other agents’ nonmonotonic reasoning. Morgensteru’s logic provides a limited way to...

متن کامل

Prioritized Autoepistemic Logic

An important problem in data and knowledge representation is the possibility of default rules that conflict. If the application of both of two default rules leads to a contradiction, they cannot both be applied. Systems that support the use of default rules may either remain indifferent or prioritize one rule over the other. In this paper a prioritized version of autoepistemic logic is presente...

متن کامل

Uniform semantic treatment of default and autoepistemic logics

We revisit the issue of connections between two leading formalisms in nonmonotonic reasoning: autoepistemic logic and default logic. For each logic we develop a comprehensive semantic framework based on the notion of a belief pair. The set of all belief pairs together with the so called knowledge ordering forms a complete lattice. For each logic, we introduce several semantics by means of fixpo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991